Computational Power of Quantum vs Classical Oracles
نویسندگان
چکیده
Comparing the computational power of quantum computers vs classical computers has been extensively studied since the invention of quantum computing. A related question is whether a quantum oracle is more powerful than a classical oracle. In this paper, we examine two topics that give partial answers to this question. We show that we can imitate a polynomial number of columns of a quantum oracle with a classical oracle. We generalize the quantum oracle separation of QMA and QCMA to obtain a quantum oracle generated by a classical oracle separation between these classes.
منابع مشابه
Comparative Computational Strength of Quantum Oracles
It is an established fact that for many of the interesting problems quantum algorithms based on queries of the standard oracle bring no significant improvement in comparison to known classical algorithms. It is conceivable that there are other oracles of algorithmic importance acting in a less intuitive fashion to which such limitations do not apply. Thus motivated this article suggests a broad...
متن کاملQuantum-classical Correspondence in the Oracle Model of Computation
The oracle model of computation is believed to allow a rigorous proof of quantum over classical computational superiority. Since quantum and classical oracles are essentially different, a correspondence principle is commonly implicitly used as a platform for comparison of oracle complexity. Here, we question the grounds on which this correspondence is based. Obviously, results on quantum speed-...
متن کاملClassical simulation complexity of extended Clifford circuits
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inp...
متن کاملProbabilistic and quantum finite automata with postselection
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L¯ ace et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the ...
متن کاملQuantum Computation Relative to Oracles
The study of the power and limitations of quantum computation remains a major challenge in complexity theory. Key questions revolve around the quantum complexity classes EQP, BQP, NQP and their derivatives. This paper presents new relativized worlds in which (i) co-RP * NQE, (ii) P = BQP and UP = EXP, (iii) P = EQP and RP = EXP, and (iv) EQP * Σ 2 ∪Π P 2 . We also show a partial answer to the q...
متن کامل